The Clan Cameron

The Cameron-Martin theorem

The Cameron–Erdős Conjecture

A subset A of the integers is said to be sum-free if there do not exist elements x, y, z ∈ A with x+y = z. It is shown that the number of sum-free subsets of {1, . . . , N} is O(2N/2), confirming a well-known conjecture of Cameron and Erdős.

VIA over the CLAN Network

The Virtual Interface Architecture is an industry standard for high performance networking in system-area networks, and the same model is proposed for Infiniband. Existing implementations suffer from high complexity, and scaling to higher bandwidths and large numbers of endpoints is likely to be problematic. We present a novel implementation of VIA that consists of a thin software layer over th...

On the Cameron-Praeger conjecture

This paper takes a significant step towards confirming a long-standing and far-reaching conjecture of Peter J. Cameron and Cheryl E. Praeger. They conjectured in 1993 that there are no nontrivial block-transitive 6-designs. We prove that the Cameron-Praeger conjecture is true for the important case of non-trivial Steiner 6-designs, i.e. for 6-(v, k, λ) designs with λ = 1, except possibly when t...

CLAN: Closely reLated ApplicatioNs

Although popular text search engines allow users to retrieve similar web pages, source code search engines do not have this feature. Knowing similarity between applications plays an important role in improving understanding and assessing reusability of these applications, rapid prototyping, and discovering code theft and plagiarism. However, detecting similar applications is a notoriously diffi...